Optimal Space Partitioning Method Based on Rectangular Duals of Planer Graphs.
نویسندگان
چکیده
منابع مشابه
On Finding the Rectangular Duals of Planar Triangular Graphs
We present a new linear time algorithm for nding rectangular duals of planar triangular graphs. The algorithm is conceptually simpler than the previous known algorithm. The coordinates of the rectangular dual constructed by our algorithm are integers and have pure combinatorial meaning. This allows us to discuss the heuristics for minimizing the size of the rectangular duals.
متن کاملTwo Algorithms for Finding Rectangular Duals of Planar Graphs
1 I n t r o d u c t i o n The problem of drawing a graph on the plane has received increasing attention due to a large number of applications [3]. Examples include VLSI layout, algorithm animation, visual languages and CASE tools. Vertices are usually represented by points and edges by curves. In the design of floor planning of electronic chips and in architectural design, it is also common to ...
متن کاملOptimal Folding of Data Flow graphs Based on Finite Projective Geometry using Vector Space Partitioning
A number of computations exist, especially in area of error-control coding and matrix computations, whose underlying data flow graphs are based on finite projective-geometry based balanced bipartite graphs. Many of these applications of projective geometry are actively being researched upon, especially in the area of coding theory. Almost all these applications need bipartite graphs of the orde...
متن کاملEqui-partitioning of Higher-dimensional Hyper-rectangular Grid Graphs
A d-dimensional grid graph G is the graph on a finite subset in the integer lattice Z in which a vertex x = (x1, x2, · · · , xn) is joined to another vertex y = (y1, y2, · · · , yn) if for some i we have |xi − yi| = 1 and xj = yj for all j 6= i. G is hyper-rectangular if its set of vertices forms [K1] × [K2] × · · · × [Kd], where each Ki is a nonnegative integer, [Ki] = {0, 1, · · · , Ki−1}. Th...
متن کاملRectangular Partitioning
Motivation The motivation for Rectangular Partitioning comes from my work. The application I help create has forms that can be designed by third parties, and it also has a layout engine that makes it easy to change the layout of a form based on the size of the form and its contents. The layout engine takes as it’s input a table of cells and their contents, along with attributes specifying how a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TRANSACTIONS OF THE JAPAN SOCIETY OF MECHANICAL ENGINEERS Series C
سال: 1994
ISSN: 0387-5024,1884-8354
DOI: 10.1299/kikaic.60.3662